Quantum Strategies Are Better Than Classical in Almost Any XOR Game
نویسندگان
چکیده
We initiate a study of random instances of nonlocal games. We show that quantum strategies are better than classical for almost any 2-player XOR game. More precisely, for large n, the entangled value of a random 2-player XOR game with n questions to every player is at least 1.21... times the classical value, for 1− o(1) fraction of all 2-player XOR games.
منابع مشابه
Provable Advantage for Quantum Strategies in Random Symmetric XOR Games
Non-local games are widely studied as a model to investigate the properties of quantum mechanics as opposed to classical mechanics. In this paper, we consider a subset of non-local games: symmetric XOR games of n players with 0-1 valued questions. For this class of games, each player receives an input bit and responds with an output bit without communicating to the other players. The winning co...
متن کاملCharacterising the Performance of XOR Games and the Shannon Capacity of Graphs
In this Letter we give a set of necessary and sufficient conditions such that quantum players of a two-party XOR game cannot perform any better than classical players. With any such game, we associate a graph and examine its zero-error communication capacity. This allows us to specify a broad new class of graphs for which the Shannon capacity can be calculated. The conditions also enable the pa...
متن کاملAdvantage of Quantum Strategies in Random Symmetric XOR Games
Non-local games are known as a simple but useful model which is widely used for displaying nonlocal properties of quantum mechanics. In this paper we concentrate on a simple subset of non-local games: multiplayer XOR games with 1-bit inputs and 1-bit outputs which are symmetric w.r.t. permutations of players. We look at random instances of non-local games from this class. We prove a tight bound...
متن کاملMultiplayer Xor Games and Quantum Communication Complexity with Clique-wise Entanglement
XOR games are a simple computational model with connections to many areas of complexity theory including interactive proof systems, hardness of approximation, and communication complexity. Perhaps the earliest use of XOR games was in the study of quantum correlations, as an experimentally realizable setup which could demonstrate non-local effects as predicted by quantum mechanics. XOR games als...
متن کاملEntanglement of approximate quantum strategies in XOR games
We show that for any ε > 0 there is an XOR game G = G(ε) with Θ(ε−1/5) inputs for one player and Θ(ε−2/5) inputs for the other player such that Ω(ε−1/5) ebits are required for any strategy achieving bias that is at least a multiplicative factor (1 − ε) from optimal. This gives an exponential improvement in both the number of inputs or outputs and the noise tolerance of any previously-known self...
متن کامل